Towards using the chordal graph polytope in learning decomposable models
نویسندگان
چکیده
منابع مشابه
The Chordal Graph Polytope for Learning Decomposable Models
This theoretical paper is inspired by an integer linear programming (ILP) approach to learning the structure of decomposable models. We intend to represent decomposable models by special zeroone vectors, named characteristic imsets. Our approach leads to the study of a special polytope, defined as the convex hull of all characteristic imsets for chordal graphs, named the chordal graph polytope....
متن کاملAlgorithms for Learning Decomposable Models and Chordal Graphs
Decomposable dependency models and their graphical counterparts, i.e., chordal graphs, possess a number of interesting and useful properties. On the basis of two character izations of decomposable models in terms of independence relationships, we develop an exact algorithm for recovering the chordal graphical representation of any given decom posable model. We also propose an algorithm for le...
متن کاملPolyhedral aspects of score equivalence in Bayesian network structure learning
The motivation for this paper is the integer linear programming approach to learning the structure of a decomposable graphical model. We have chosen to represent decomposable models by means of special zero-one vectors, named characteristic imsets. Our approach leads to the study of a special polytope, defined as the convex hull of all characteristic imsets for chordal graphs, named the chordal...
متن کاملOn the Minimum Chordal Completion Polytope
David Bergman Operations and Information Management, University of Connecticut, Storrs, Connecticut 06260 [email protected] Carlos H. Cardonha IBM Research, Brazil, São Paulo 04007-900 [email protected] Andre A. Cire Department of Management, University of Toronto Scarborough, Toronto, Ontario M1C-1A4, Canada, [email protected] Arvind U. Raghunathan Mitsubishi Electr...
متن کاملLearning Decomposable Models for Classification
In some situations graphical models are learned to be used for classification of one given variable. The standard learning algorithms usually do not take this background knowledge into account. In the case of Bayesian networks this knowledge is often incorporated by assuming that the target variable will have no parents. This leads to discovering potentially bigger Markov boundaries of the targ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2017
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2017.06.001